Discrete Nodal Domain Theorems
نویسندگان
چکیده
We prove two discrete analogues of Courant’s Nodal Domain Theorem.
منابع مشابه
für Mathematik in den Naturwissenschaften Leipzig Nodal Domain Theorems and Bipartite Subgraphs ( revised
The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by th...
متن کاملNodal Decompositions of Graphs
A nodal domain of a function is a maximally connected subset of the domain for which the function does not change sign. Courant’s nodal domain theorem gives a bound on the number of nodal domains of eigenfunctions of elliptic operators. In particular, the kth eigenfunction contains no more than k nodal domains. We prove a generalization of Courant’s theorem to discrete graphs. Namely, we show t...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملApproximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuous functions C(X,G) (X compact, G a topological group) to be uniformly dense. These criteria are based on the existence of so-called condensing functions, where a continuous function φ : G → G is said to be condensing ...
متن کاملNo-Free-Lunch theorems in the continuum
No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions. This fact was precisely formulated for the first time in a now famous paper by Wolpert and Macready, and then subsequently refined and extended by several authors, always in the context of a set of functions with discrete domain and codom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000